Regularity of splicing languages

Regularity of Splicing Languages

Motivated by the recombinant behavior of DNA, Tom Head introduced a scheme for the evolution of formal languages called splicing. We give a simpler proof of the fundamental fact that the closure of a regular language under iterated splicing using a finite number of splicing rules is again regular. We then extend this result in two directions, by incorporating circular strings and by using infin...

Splicing and Regularity

Splicing Systems: Regularity and Below

The motivation for the development of splicing theory is recalled. Attention is restricted to finite splicing systems, which are those having only finitely many rules and finitely many initial strings. Languages generated by such systems are necessarily regular, but not all regular languages can be so generated. The splicing systems that arose originally, as models of enzymatic actions, have tw...

A Proof of Regularity for Finite Splicing

We present a new proof that languages generated by (non extended) H systems with finite sets of axioms and rules are regular.

On Notions of Regularity for Data Languages

Motivated by considerations in XML theory and model checking, data strings have been introduced as an extension of finite alphabet strings which carry, at each position, a symbol and a data value from an infinite domain. Previous work has shown that it is not easy to come up with an expressive yet decidable automata model for data languages. Recently, such an automata model, data automata has b...